#include<iostream>
using namespace std;
#include"BSTree.h"

int main()
{
	BSTree BST;
	InitBST(BST);

	//int str[] = { 30,23,36,10,7,3,27,25,26,36,39,38,34,35,33,50,51 };
	//int str[] = { 30,23,36,10,7,3,27,25,26,36,39,50,51 };
	int str[] = { 30 };
	int count = sizeof(str) / sizeof(str[0]);
	Creat_BST(BST, str, count);

	FirOrder(BST);
	cout << endl;

	DelNode(BST, 30);

	//BST_Search_key(BST, 27);

	FirOrder(BST);
	cout << endl;

	return 0;
}